Topological Design of Computer Communication Networks

The goal of topological design of a k-connected computer communication network is to achieve a specified performance at minimal cost/delay. Unfortunately, the problem is completely intractable. A reasonable approach is to generate a potential network topology. Stieglitz, Weiner and Kleitman have presented a heuristic for generating a potential network topology. This heuristic begins by numbering the nodes at random. This paper presents a systematic method for numbering the nodes when the nodes (assumed even in number), all lie on a straight line, are equispaced and the connectivity that is sought is even. Assuming that the cost of a link is proportional to its length, the method presented has been found to give the cheapest starting network. When the nodes are numbered in a systematic manner, the potential network topology requires minimum perturbation before an acceptable network is found.